Buscar
Mostrando ítems 1-10 de 1903
A column generation approach for the maximal covering location problem
(2007-01-01)
This article presents a column generation algorithm to calculate new improved lower bounds to the solution of maximal covering location problems formulated as a p-median problem. This reformulation leads to instances that ...
Hybrid heuristics based on column generation with path-relinking for clustering problems
(Elsevier B.V., 2014-09-01)
This paper examines hybrid heuristics for solving clustering problems. the clustering problem can be defined as the process of separating a set of objects into groups such that members of a group are similar to each other. ...
A column generation approach to capacitated p-median problems
(Elsevier B.V., 2004-05-01)
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation ...
A column generation approach to capacitated p-median problems
(Elsevier B.V., 2004-05-01)
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation ...
Column generation bounds for numerical microaggregation
(Springer, 2014-02-18)
A column generation approach for solving generation expansion planning problems with high renewable energy penetration
(Elsevier, 2016)
The high penetration of renewables envisaged for future power systems will significantly increasethe need for flexible operational measures and generation technologies, whose associated investmentdecisions must be properly ...
A branch-and-price approach to p-median location problems
(Elsevier B.V., 2005-06-01)
This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is ...
A branch-and-price approach to p-median location problems
(Elsevier B.V., 2005-06-01)
This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is ...
A column generation approach to capacitated p-median problems
(Elsevier B.V., 2014)
A column generation approach to multiscale capacity planning for power-intensive process networks
(Springer New York LLC, 2019)
Due to the high volatility in electricity prices, power-intensive industrial plants often have to frequently shift load in order to remain cost-competitive. Capacity planning is required for assessing the value of additional ...